class Solution:
def searchRange(self, nums: List[int], target: int) -> List[int]:
arr = [-1, -1]
start = 0
end = len(nums) -1
while start<= end:
mid = (start+end)//2
if nums[mid] == target:
end = mid-1
arr[0] = mid
elif nums[mid] < target:
start = mid+1
else:
end = mid-1
start = 0
end = len(nums) -1
while start<= end:
mid = (start+end)//2
if nums[mid] == target:
start = mid+1
arr[1] = mid
elif nums[mid] < target:
start = mid+1
else:
end = mid-1
return arr
768A - Oath of the Night's Watch | 156C - Cipher |
545D - Queue | 459B - Pashmak and Flowers |
1538A - Stone Game | 1454C - Sequence Transformation |
165B - Burning Midnight Oil | 17A - Noldbach problem |
1350A - Orac and Factors | 1373A - Donut Shops |
26A - Almost Prime | 1656E - Equal Tree Sums |
1656B - Subtract Operation | 1656A - Good Pairs |
1367A - Short Substrings | 87A - Trains |
664A - Complicated GCD | 1635D - Infinite Set |
1462A - Favorite Sequence | 1445B - Elimination |
1656C - Make Equal With Mod | 567A - Lineland Mail |
1553A - Digits Sum | 1359B - New Theatre Square |
766A - Mahmoud and Longest Uncommon Subsequence | 701B - Cells Not Under Attack |
702A - Maximum Increase | 1656D - K-good |
1426A - Floor Number | 876A - Trip For Meal |